Kentucky and West Virginia are among the states most severely affected by opioid poisonings and deaths. The legislatures of both states have enacted a broad range of bills intended to address related issues. We present an overview of legislation enacted in 2017 and 2018, along with an approach to analysis of practitioner response to one type of legislation.

We propose a revised set of moral dilemmas for studies on moral judgment. We selected a total of 46 moral dilemmas available in the literature and fine-tuned them in terms of four conceptual factors (Personal Force, Benefit Recipient, Evitability and Intention) and methodological aspects of the dilemma formulation (word count, expression style, question formats) that have been shown to influence moral judgment. Second, we obtained normative codings of arousal and valence for each dilemma showing that emotional arousal in response to (...) moral dilemmas depends crucially on the factors Personal Force, Benefit Recipient, and Intentionality. Third, we validated the dilemma set confirming that people's moral judgment is sensitive to all four conceptual factors, and to their interactions. Results are discussed in the context of this field of research, outlining also the relevance of our RT effects for the Dual Process account of moral judgment. Finally, we suggest tentative theoretical avenues for future testing, particularly stressing the importance of the factor Intentionality in moral judgment. Additionally, due to the importance of cross-cultural studies in the quest for universals in human moral cognition, we provide the new set dilemmas in six languages (English, French, German, Spanish, Catalan and Danish). The norming values provided here refer to the Spanish dilemma set. (shrink)

We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of finite rank. For both kinds of groups, the computable ones all have computable \ Scott sentences. Sometimes we can do better. In fact, the computable finitely generated groups that we have studied all have Scott sentences that are “computable d-\” sentence and a (...) computable \ sentence). In [9], this was shown for the finitely generated free groups. Here we show it for all finitely generated abelian groups, and for the infinite dihedral group. Among the computable torsion-free abelian groups of finite rank, we focus on those of rank 1. These are exactly the additive subgroups of \. We show that for some of these groups, the computable \ Scott sentence is best possible, while for others, there is a computable d-\ Scott sentence. (shrink)

In [3], two different effective versions of Borel embedding are defined. The first, called computable embedding, is based on uniform enumeration reducibility, while the second, called Turing computable embedding, is based on uniform Turing reducibility. While [3] focused mainly on computable embeddings, the present paper considers Turing computable embeddings. Although the two notions are not equivalent, we can show that they behave alike on the mathematically interesting classes chosen for investigation in [3]. We give a “Pull-back Theorem”, saying that if (...) Φ is a Turing computable embedding of K into K’, then for any computable infinitary sentence φ in the language of K’, we can find a computable infinitary sentence φ* in the language of K such that for all. (shrink)

There is a Turing computable embedding $\Phi $ of directed graphs $\mathcal {A}$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform effective interpretation; i.e., for all directed graphs $\mathcal {A}$, these formulas interpret $\mathcal {A}$ in $\Phi $. It follows that $\mathcal {A}$ is Medvedev reducible to $\Phi $ uniformly; i.e., $\mathcal {A}\leq _s\Phi $ with a fixed Turing operator that serves for all $\mathcal {A}$. We observe that there is a graph G (...) that is not Medvedev reducible to any linear ordering. Hence, G is not effectively interpreted in any linear ordering. Similarly, there is a graph that is not interpreted in any linear ordering using computable $\Sigma _2$ formulas. Any graph can be interpreted in a linear ordering using computable $\Sigma _3$ formulas. Friedman and Stanley [4] gave a Turing computable embedding L of directed graphs in linear orderings. We show that there is no fixed tuple of $L_{\omega _1\omega }$ -formulas that, for all G, interpret the input graph G in the output linear ordering $L$. Harrison-Trainor and Montalbán [7] have also shown this, by a quite different proof. (shrink)

Metaphysics, traditionally conceived, has often been defined as the inquiry into what lies beyond or is independent of experience, but which nonetheless pertains to the fundamental structure of reality. Thus understood, metaphysics produces claims that are not empirically testable. The 20th century logical empiricists famously—and ferociously—criticised metaphysics on these grounds as being devoid of cognitive content. Despite logical empiricism’s seminal role in the genesis and propagation of the analytic tradition in academic philosophy, metaphysics has made a remarkable comeback during the (...) second half of the 20th century. Contemporary analytic metaphysicians unabashedly refer to intuitions, conceptual analysis, and other genuinely philosophical, speculative methods in their search for insights into the fundamental nature of reality. Or so it seems. (shrink)

Preface to Journal of General Philosophy of Science, issue 2: Meta2physics. New Perspectives on Analytic and Naturalised Metaphysics of Science.

Tobias Rosefeldt argues that in order to reconcile a physics-based fundamental ontology with the ontological implications of our everyday utterances, philosophers should pursue a ‘linguistics-based conciliatory’ strategy: They should refer to the results of linguistic research in order to avoid ontological commitment to problematic entities. Whereas Rosefeldt is not an advocate of radical forms of naturalized metaphysics, his argument is driven by the motivation behind pleas for a naturalization of the discipline. I claim that although there is a need for (...) reconciliation, Rosefeldt’s favored account falls short of this goal. More generally, I argue that so-called ‘conciliatory accounts’ fail to do justice to the motivation that necessitated them in the first place, as the role they assign to analyses of everyday speech in search of ontological commitments is at odds with said motivation. ‘Conciliatory accounts’, hence, sit uneasily between radically naturalistic and traditional armchair approaches to metaphysics. (shrink)

“Dance” has been associated with many psychophysiological and medical health effects. However, varying definitions of what constitute “dance” have led to a rather heterogenous body of evidence about such potential effects, leaving the picture piecemeal at best. It remains unclear what exact parameters may be driving positive effects. We believe that this heterogeneity of evidence is partly due to a lack of a clear definition of dance for such empirical purposes. A differentiation is needed between (a) the effects on the (...) individual when the activity of “dancing” is enjoyedas a dancerwithindifferent dance domains(e.g.,professional/”high-art”type of dance,eroticdance,religiousdance,clubdancing,Dance Movement Therapy(DMT), and what is commonly known ashobby, recreationalorsocialdance), and (b) the effects on the individual within these different domains, as a dancer of thedifferent dance styles(solo dance, partnering dance, group dance; and all the different styles within these). Another separate category of dance engagement is, not as a dancer, but as a spectator of all of the above. “Watching dance” as part of an audience has its own set of psychophysiological and neurocognitive effects on the individual, and depends on the context where dance is witnessed. With the help of dance professionals, we first outline some different dance domains and dance styles, and outline aspects that differentiate them, and that may, therefore, cause differential empirical findings when compared regardless (e.g., amount of interpersonal contact, physical exertion, context, cognitive demand, type of movements, complexity of technique and ratio of choreography/improvisation). Then, we outline commonalities between all dance styles. We identify six basic components that are part of any dance practice, as part of a continuum, and review and discuss available research for each of them concerning the possible health and wellbeing effects of each of these components, and how they may relate to the psychophysiological and health effects that are reported for “dancing”: (1) rhythm and music, (2) sociality, (3) technique and fitness, (4) connection and connectedness (self-intimation), (5) flow and mindfulness, (6) aesthetic emotions and imagination. Future research efforts might take into account the important differences between types of dance activities, as well as the six components, for a more targeted assessment of how “dancing” affects the human body. (shrink)

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence, in terms of relatively simple invariants. Where this is impossible, it is useful to have concrete results saying so. In model theory and descriptive set theory, there is a large body of work showing that certain classes of mathematical structures admit classification while others do not. In the present paper, we (...) describe some recent work on classification in computable structure theory.Section 1 gives some background from model theory and descriptive set theory. From model theory, we give sample structure and non-structure theorems for classes that include structures of arbitrary cardinality. We also describe the notion of Scott rank, which is useful in the more restricted setting of countable structures. From descriptive set theory, we describe the basic Polish space of structures for a fixed countable language with fixed countable universe. We give sample structure and non-structure theorems based on the complexity of the isomorphism relation, and on Borel embeddings.Section 2 gives some background on computable structures. We describe three approaches to classification for these structures. The approaches are all equivalent. However, one approach, which involves calculating the complexity of the isomorphism relation, has turned out to be more productive than the others. Section 3 describes results on the isomorphism relation for a number of mathematically interesting classes—various kinds of groups and fields. In Section 4, we consider a setting similar to that in descriptive set theory. We describe an effective analogue of Borel embedding which allows us to make distinctions even among classes of finite structures. Section 5 gives results on computable structures of high Scott rank. Some of these results make use of computable embeddings. Finally, in Section 6, we mention some open problems and possible directions for future work. (shrink)

Makkai [10] produced an arithmetical structure of Scott rank $\omega _{1}^{\mathit{CK}}$. In [9]. Makkai's example is made computable. Here we show that there are computable trees of Scott rank $\omega _{1}^{\mathit{CK}}$. We introduce a notion of "rank homogeneity". In rank homogeneous trees, orbits of tuples can be understood relatively easily. By using these trees, we avoid the need to pass to the more complicated "group trees" of [10] and [9]. Using the same kind of trees, we obtain one of rank (...) $\omega _{1}^{\mathit{CK}}$ that is "strongly computably approximable". We also develop some technology that may yield further results of this kind. (shrink)

In [8], the third author defined a reducibility$\le _w^{\rm{*}}$that lets us compare the computing power of structures of any cardinality. In [6], the first two authors showed that the ordered field of reals${\cal R}$lies strictly above certain related structures. In the present paper, we show that$\left \equiv _w^{\rm{*}}{\cal R}$. More generally, for the weak-looking structure${\cal R}$ℚconsisting of the real numbers with just the ordering and constants naming the rationals, allo-minimal expansions of${\cal R}$ℚare equivalent to${\cal R}$. Using this, we show that (...) for any analytic functionf,$\left \equiv _w^{\rm{*}}{\cal R}$. $is noto-minimal.). (shrink)

Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r. e. Here we generalize this to arbitrary levels in Ershov's hierarchy of Δmath image sets, giving conditions under which a relation is intrinsically α-r. e.

§0. Introduction. In [16], Barwise described his graduate study at Stanford. He told of his interactions with Kreisel and Scott, and said how he chose Feferman as his advisor. He began working on admissible fragments of infinitary logic after reading and giving seminar talks on two Ph.D. theses which had recently been completed: that of Lopez-Escobar, at Berkeley, on infinitary logic [46], and that of Platek [58], at Stanford, on admissible sets.Barwise's work on infinitary logic and admissible sets is described (...) in his thesis [4], the book [13], and papers [5]—[16]. We do not try to give a systematic review of these papers. Instead, our goal is to give a coherent introduction to infinitary logic and admissible sets. We describe results of Barwise, of course, because he did so much. In addition, we mention some more recent work, to indicate the current importance of Barwise's ideas. Many of the central results are stated without proof, but occasionally we sketch a proof, to indicate how the ideas fit together.Chapters 1 and 2 describe infinitary logic and admissible sets at the time Barwise began his work, circa 1965. From Chapter 3 on, we survey the developments that took place after Barwise appeared on the scene.§1. Background on infinitary logic. In this chapter, we describe the situation in infinitary logic at the time that Barwise began his work. We need some terminology. By a vocabulary, we mean a set L of constant symbols, and relation and operation symbols with finitely many argument places. As usual, by an L-structureM, we mean a universe set M with an interpretation for each symbol of L. (shrink)

We study the relative computational power of structures related to the ordered field of reals, specifically using the notion of generic Muchnik reducibility. We show that any expansion of the reals by a continuous function has no more computing power than the reals, answering a question of Igusa, Knight, and Schweber [7]. On the other hand, we show that there is a certain Borel expansion of the reals that is strictly more powerful than the reals and such that any Borel (...) quotient of the reals reduces to it. (shrink)

This volume documents the 17th Münster Lectures in Philosophy with Susan Haack, the prominent contemporary philosopher. It contains an original, programmatic article by Haack on her overall philosophical approach, entitled ‘The Fragmentation of Philosophy, the Road to Reintegration’. In addition, the volume includes seven papers on various aspects of Haack’s philosophical work as well as her replies to the papers. Susan Haack has deeply influenced many of the debates in contemporary philosophy. In her vivid and accessible way, she has made (...) ground-breaking contributions covering a wide range of topics, from logic, metaphysics and epistemology, to pragmatism and the philosophy of science and law. In her work, Haack has always been very sensitive in detecting subtle differences. The distinctions she has introduced reveal what lies at the core of philosophical controversies, and show the problems that exist with established views. In order to resolve these problems, Haack has developed some ‘middle-course approaches’. One example of this is her famous ‘Foundherentism’, a theory of justification that includes elements from both the rival theories of Foundationalism and Coherentism. Haack herself has offered the best description of her work calling herself a ‘passionate moderate’. (shrink)